Selecting the k largest elements with parity tests
نویسندگان
چکیده
منابع مشابه
How to select the largest k elements from evolving data?
In this paper we investigate the top-k-selection problem, i.e. determine the largest, second largest, ..., and the k-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied [2]: finding the l...
متن کاملEstimating the Largest Elements of a Matrix
We derive an algorithm for estimating the largest p ≥ 1 values aij or |aij | for an m×n matrix A, along with their locations in the matrix. The matrix is accessed using only matrix– vector or matrix–matrix products. For p = 1 the algorithm estimates the norm ‖A‖M := maxi,j |aij | or maxi,j aij . The algorithm is based on a power method for mixed subordinate matrix norms and iterates on n × t ma...
متن کاملA Characterization of the Suzuki Groups by Order and the Largest Elements Order
One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property. Let be a finite group. We denote by the largest order of elements of . In this paper, we prove that some Suzuki groups are characterizable by order and the largest order of elements. In fact, we prove that if is a group with an...
متن کاملthe washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests
در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است
15 صفحه اولThe Largest Parity Demigenus of a Simple Graph
A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according as its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is Euler characteristic) over all surfaces S in which 1 can be parity embedded. We calculate the maximum parity demigenus over all loopless graphs of order n. As a corollary we strengthe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00193-6